Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003

Security Analysis of the MOR Cryptosystem

The paper cryptanalyses a new public key cryptosystem that has been recently proposed by Paeng, Ha, Kim, Chee and Park [5]. The scheme works on finite non-abelian groups. We focus on the group SL(2, ZZp)×θ ZZp which was discussed in [5] extensively.

A Lattice Based Public Key Cryptosystem Using Polynomial Representations

In Crypto 97, a public key cryptosystem based on the closest vector problem was suggested by Goldreich, Goldwasser and Halevi [4]. In this paper, we propose a public key cryptosystem applying representations of polynomials to the GGH encryption scheme. Its key size is much smaller than the GGH system so that it is a quite practical and efficient lattice based cryptosystem.

Improved Public Key Cryptosystem using Finite non Abelian Groups

Cryptanalysis of the Huang-Liu-Yang Cryptosystem from PKC 2012

This short note describes a key-recovery attack against a multi-variate quadratic cryptosystem proposed by Huang, Liu, and Yang (PKC 2012). Our attack is running lattice-basis reduction algorithms on a lattice constructed from the keys in the cryptosystem. The attack takes less than 20 minutes for the proposed parameter sets which are expected to be 80-bit and 128-bit security.

Study of McEliece cryptosystem

This report presents a study of the public-key cryptosystem (PKC) proposed by R. J. McEliece in 1978 [25]. The McEliece cryptosystem is based on error-correcting linear codes and is one of the first and so far the most succesful cryptosystem based on notions of coding theory. The original construction in [25] uses binary Goppa codes to encrypt and decrypt messages. Many other variants of the cr...